Algorithm for converting Infix to Postfix:

(1)	Create a stack for storing operators

(2)	Initialize the Postfix expression to the empty string

(3)	Scan the Infix expression from left-to-right

(4)	If the symbol is an operand, append it to the Postfix expression

(5)	If the symbol is an operator

      a. While the top operator on the stack has precedence >= 
         the new operator, pop the top operator and append it 
         to the Postfix expression

      b. Push the new operator onto the stack

(6)	After the Infix expression has been completely processed, 
    pop each operator left on the stack and append it to the 
    Postfix expression